Parallel Database Sort and Join Operations Revisited on Grids
نویسندگان
چکیده
Based on the renowned method of Bitton et al. (see [1]) we develop a concise but comprehensive analytical model for the well-known Binary Merge Sort, Bitonic Sort, Nested-Loop Join and Sort Merge Join algorithm in a Grid Environment. We concentrate on a limited number of characteristic parameters to keep the analytical model clear and focused. Based on these results the paper proves that by smart enhancement exploiting the specifics of the Grid the performance of the algorithms can be increased and some results of Bitton et al. for a homogenous multi-processor architecture are to be invalidated and reversed.
منابع مشابه
Parallel Implementation of External Sort and Join Operations on a Multi-core Network-Optimized System on a Chip
In a commercial Relational Database Management System (RDBMS), sort and join are the most demanding operations, and it is quite beneficial to improve the performance of external sort and external join algorithms that handle large input data sizes. This paper proposes parallel implementations of multithreaded external sort and external hash join algorithms to accelerate IBM DB2, one of leading R...
متن کاملNested Loops Revisited
The research community has considered hash-based parallel join algorithms the algorithms of choice for almost a decade. However, almost none of the commercial parallel database systems use hashing-based join algorithms, using instead nested-loops with index or sort-merge. While the research literature abounds with comparisons between the various hash-based and sort-merge join algorithms, to our...
متن کاملParallel Implementation of Relational Database Management Systems Operations on a Multi-Core Network-Optimized System on a Chip
In a commercial Relational Database Management System (RDBMS), sort and join are the most demanding operations and it is quite beneficial to improve the performance of external sort and external join algorithms that handle large input data sizes. This paper proposes parallel implementations of multi-threaded external sort and external hash join algorithms to accelerate IBM DB2, one of leading R...
متن کاملParallel Query Processing
With relations growing larger and queries becoming more complex, parallel query processing is an increasingly attractive option for improving the performance of database systems. The objective of this paper is to examine the various issues encountered in parallel query processing and the techniques available for addressing these issues. The focus of the paper is on the join operation with both ...
متن کاملParallel Processing of JOIN Queries in OGSA-DAI
JOIN Query is the most important and often most expensive of all relational operations, especially when its input is obtained from considerable size of tables on distributed heterogeneous database. As parallel join processing is a well understood technique to get results as quickly as possible, one way to speed up query execution is to exploit parallelism. Since most real queries involve joins ...
متن کامل